Combining Metaheuristics and Integer Programming on School Timetabling problems
نویسندگان
چکیده
Fischetti and Lodi (2003) proposed the use of general MIP solvers to explore large neighborhoods around reference solutions. In the original article, this appeared as a branching strategy aimed at improving the practical behavior of exact methods, producing better solutions earlier. As predicted in this work, the potential of similar techniques in a heuristic context was worthy of further investigation. A number of papers on that subject, MIP based heuristics, already appeared. In particular, Hansen and others borrowed VNS concepts to improve such heuristics. In this work we explore the use of MIP search to improve a Tabu Search for a Class x Teacher Timetabling Problem. Besides exploring neighborhoods around reference solutions we consider exploring ellipsoidal neighborhoods, which uses information from pairs of solutions from an Elite Pool. Proposals for automatic neighborhood size selection are also discussed. Computational experiments demonstrate that signi cant improvements can be achieved with the proposed method.
منابع مشابه
An Integer Programming Model for the School Timetabling Problem
This work presents a binary integer programming model applied to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. Pairs of teachers and classes associated to timeslots are modeled as binary integer variables weighted by parameters referring to teachers p...
متن کاملModeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملبرنامهریزی درسی در دانشگاه به کمک مدلسازی دو مرحلهای برنامهریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملA genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کامل